Executing Higher Order Logic
نویسندگان
چکیده
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are compiled into a functional program. Functions and inductively defined relations can be mixed. Inductive definitions must be such that they can be executed in Prolog style but requiring only matching rather than unification. This restriction is enforced by a mode analysis. Tail recursive partial functions can be defined and executed with the help of a while combinator.
منابع مشابه
Tabled Higher-Order Logic Programming
A logical framework is a general meta-language for specifying and implementing deductive systems, given by axioms and inference rules. Based on a higher-order logic programming interpretation, it supports executing logical systems and reasoning with and about them, thereby reducing the effort required for each particular logical system. In this thesis, we describe different techniques to improv...
متن کاملExecuting Formal Specifications by Translation to Higher Order Logic Programming
We describe the construction and use of a system for translating higher order logic-based speciications into programs in the higher order logic programming language Lambda Prolog. The translation improves on previous work in the eld of executing speciications by allowing formulas with quantiiers to be executed, and by permitting users to pose Prolog-style queries with free variables to be insta...
متن کاملLocating of planting project using Analytic Hierarchy Process and Fuzzy logic (case study: Maravehtappe watershed, Golestan province)
Planting project is one of the methods for improvement of rangeland degradation that exact implementation depends on many factors. Therefore, there is a need for a fundamental method. In the present study for locating planting project, in Maravehtappe watershed, analytic hierarchical process and fuzzy logic are applied. In this study, four ecological criteria of vegetation, soil, physiography a...
متن کاملSimple Parsimonious Types and Logarithmic Space
We present a functional characterization of deterministic logspace-computable predicates based on a variant (although not a subsystem) of propositional linear logic, which we call parsimonious logic. The resulting calculus is simply-typed and contains no primitive besides those provided by the underlying logical system, which makes it one of the simplest higher-order languages capturing logspac...
متن کاملRealizing the Dependently Typed Λ-calculus
Dependently typed λ-calculi such as the Edinburgh Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and their proofs. Such calculi can also be given a logic programming interpretation: the system is based on such an interpretation of LF. We have considered whether a conventional logic programming language can also p...
متن کاملFormal Logic Based Configuration Modeling and Verification for Dynamic Component Systems
Reconfigurable networked systems have often been developed via dynamically deployed software components that are executing on top of interconnected heterogenous hardware nodes. The challenges resulting from the complexity of those systems have been traditionally mitigated by creative ad-hoc solutions supported by domain specific modeling frameworks and methodologies. Targeting that deficiency, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000